Focused Linear Logic and the λ-calculus

نویسندگان

  • Taus Brock-Nannestad
  • Nicolas Guenot
چکیده

Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation of focused proofs, a complete subclass of linear sequent proofs known to have a much stronger structure than the standard sequent calculus for linear logic. Despite the classical setting, the interpretation relates proofs to a refined linear λ-calculus, and we investigate its properties and relation to other calculi, such as the usual λ-calculus, the λμ-calculus, and their variants based on sequent calculi.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Resource Lambda Calculus Is Short-Sighted in Its Relational Model

Relational semantics is one of the simplest and categorically most natural semantics of Linear Logic. The co-Kleisli category MRel associated with its multiset exponential comonad contains a fully abstract model of the untyped λ-calculus. That particular object of MRel is also a model of the resource λ-calculus, deriving from Ehrhard and Regnier’s differential extension of Linear Logic and rela...

متن کامل

From shift and reset to polarized linear logic

Griffin [22] pointed out that, just as the pure λ-calculus corresponds to intuitionistic logic, a λ-calculus with firstclass continuations corresponds to classical logic. We study how first-class delimited continuations [13], in the form of Danvy and Filinski’s shift and reset operators [10, 11], can also be logically interpreted. First, we refine Danvy and Filinski’s type system for shift and ...

متن کامل

The Girard Translation Extended with Recursion

This paper extends Curry-Howard interpretations of Intuitionistic Logic (IL) and Intuitionistic Linear Logic (ILL) with rules for recursion. The resulting term languages, the λ-calculus and the linear λ-calculus respectively, are given sound categorical interpretations. The embedding of proofs of IL into proofs of ILL given by the Girard Translation is extended with the rules for recursion, suc...

متن کامل

Infinitary $\lambda$-Calculi from a Linear Perspective (Long Version)

We introduce a linear infinitary λ-calculus, called `Λ∞, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted coinductively. The obtained calculus embeds the infinitary applicative λ-calculus and is universal for computations over infinite strings. What is particularly interesting about `Λ∞, is that the re...

متن کامل

A System F accounting for scalars

The algebraic λ-calculus [40] and the linear-algebraic λ-calculus [3] extend the λ-calculus with the possibility of making arbitrary linear combinations of λ-calculus terms (preserving ∑ αi.ti). In this paper we provide a fine-grained, System F -like type system for the linear-algebraic λ-calculus (Lineal). We show that this scalar type system enjoys both the subject-reduction property and the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 319  شماره 

صفحات  -

تاریخ انتشار 2015